package A一周刷爆LeetCode.A基础班.E链表;

/**
 * @author wei.zhao
 * @description: 打印两个有序链表的公共部分
 * @date 2022年01月25日 11:36
 */
public class Code03_PrintCommonPart {

    public static void main(String[] args) {
        Node node1 = new Node(2);
        node1.next = new Node(3);
        node1.next.next = new Node(5);
        node1.next.next.next = new Node(6);
        Node node2 = new Node(1);
        node2.next = new Node(2);
        node2.next.next = new Node(5);
        node2.next.next.next = new Node(7);
        node2.next.next.next.next = new Node(8);
        printCommonPart(node1, node2);
    }

    public static void printCommonPart(Node head1, Node head2) {
        System.out.print("相同部分是：");
        while (null != head1 && null != head2) {
            if (head1.value > head2.value) {
                head2 = head2.next;
            } else if (head1.value < head2.value) {
                head1 = head1.next;
            } else {
                System.out.print(head1.value + " ");
                head1 = head1.next;
                head2 = head2.next;
            }
        }
    }

}
